A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
نویسندگان
چکیده
The number of triangulations of a planar n point set is known to be c, where the base c lies between 2.43 and 30. The fastest known algorithm for counting triangulations of a planar n point set runs in O∗(2n) time. The fastest known arbitrarily close approximation algorithm for the base of the number of triangulations of a planar n point set runs in time subexponential in n. We present the first quasi-polynomial approximation scheme for the base of the number of triangulations of a planar point set.
منابع مشابه
A QPTAS for the base of the number of crossing-free structures on a planar point set
The number of triangulations of a planar n point set S is known to be c, where the base c lies between 8.65 and 30. Similarly, the number of spanning trees on S is known to be d, where the base d lies between 12.52 and 141.07. The fastest known algorithm for counting triangulations of S runs in O∗(2n) time while that for counting spanning trees on S enumerates them in Ω(12.52) time. The fastest...
متن کاملOn the Number of Pseudo-Triangulations of Certain Point Sets
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it in two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically 12n pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far.
متن کاملMHD Three-Dimensional Stagnation-Point Flow and Heat Transfer of a Nanofluid over a Stretching Sheet
In this study, the three-dimensional magnetohydrodynamic (MHD) boundary layer of stagnation-point flow in a nanofluid was investigated. The Navier–Stokes equations were reduced to a set of nonlinear ordinary differential equations using a similarity transform. The similarity equations were solved for three types of nanoparticles: copper, alumina and titania with water as the base fluid, to inve...
متن کاملGeneral Formulation to Investigate Scattering from Multilayer Lossy Inhomogeneous Metamaterial Planar Structures
This paper presents a general formulation to investigate the scattering from Multilayer Lossy Inhomogeneous Metamaterial Planar Structure (MLIMPS) with arbitrary number of layers and polarization. First, the dominating differential equation of transverse components of electromagnetic fields in each layers derived. Considering the general form of solution of the differential equations and the bo...
متن کاملTEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES BLAVATNIK SCHOOL OF COMPUTER SCIENCE Counting Triangulations of Planar Point Sets
We study the maximal number of triangulations that a planar set of n points can have, and show that it is at most 30n. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has led to previous best upper bound of 43n for the problem. Moreover, this new bound is useful for bounding the number of other types of planar (i.e., crossing free) s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1411.0544 شماره
صفحات -
تاریخ انتشار 2014